A Relevant Analysis of Natural DeductionS

نویسندگان

  • S S Ishtiaq
  • D J Pym
چکیده

We study a framework, RLF, for deening natural deduction presentations of linear and other relevant logics. RLF consists in a language together, in a manner similar to that of LF, with a representation mechanism. The language of RLF, the-calculus, is a system of rst-order linear dependent function types which uses a function to describe the degree of sharing of variables between functions and their arguments. The representation mechanism is judgements-as-types, developed for linear and other relevant logics. The-calculus is a conservative extension of the-calculus and RLF is a conservative extension of LF.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ultimate Normal Forms for Parallelized Natural Deductions

The system of natural deduction that originated with Gentzen (1934–5), and for which Prawitz (1965) proved a normalization theorem, is re-cast so that all elimination rules are in parallel form. This enables one to prove a very exigent normalization theorem. The normal forms that it provides have all disjunction-eliminations as low as possible, and have no major premisses for eliminations stand...

متن کامل

Rewriting for Fitch Style Natural Deductions

Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ordinary mathematical practice, is given in [Fitch 1952]. We define precisely a CurryHoward interpretation that maps Fitch style deductions to simply typed terms, and we analyze why it is not an isomorphism. We then descri...

متن کامل

Insurance Deductions of Hospitals in Iran: Systematic Review of Causes and Solutions to Reduce Deductions

Insurance Deductions of Hospitals in Iran: Systematic Review of Causes and Solutions to Reduce Deductions Aidin Aryankhesal1, Hadi Kalantari1, Pouran Raeissi1, Niusha Shahidi Sadeghi1, * 1Department of Health Services Management, School of Health Management and Information Sciences, Iran University of Medical Sciences, Tehran, Iran Abstract Background: This study was conducted via a systemat...

متن کامل

Mulitlanguage First Order Theories of Propositional Attitudes

can thus restrict ourselves to normal form deductions. The proof is again by induction on the length of the deduction. All the deductions not involving R down and R up are trivially translated and not considered. As we are considering normal form deductions , we cannot have branches with applications of R up before the application of R down. Moreover, since all the deductions start from wws of ...

متن کامل

NP vs PSPACE

We present a proof of the conjecture NP = PSPACE by showing that arbitrary tautologies of Johansson’s minimal propositional logic admit “small” polynomial-size dag-like natural deductions in Prawitz’s system for minimal propositional logic. These “small” deductions arise from standard “large” tree-like inputs by horizontal dag-like compression that is obtained by merging distinct nodes labeled ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996